Not every countable complete distributive lattice is sober
نویسندگان
چکیده
Abstract The study of the sobriety Scott spaces has got a relatively long history in domain theory. Lawson and Hoffmann independently proved that space every continuous directed complete poset (usually called domain) is sober. Johnstone constructed first whose non-sober. Soon after, Isbell gave lattice with non-sober space. Based on Isbell’s example, Xu, Xi, Zhao showed there even Heyting algebra Achim Jung then asked whether countable sober main aim this paper to answer Jung’s problem by constructing This modified obtain distributive In addition, we prove topology product $\Sigma P\times \Sigma Q$ coincides $P\times if set Id ( P ) Q all incremental ideals posets are both countable. this, it deduced space, P$ coherent well filtered. particular, L
منابع مشابه
Not Every Feeling Is Intentional
The most promising representionalist account of sensations and occurrent emotions is the ‘impure’ version of representationalism, which analyses the structure of an intentional state as consisting of an intentional content and a psychological mode. However, a critique of representationalism could question the analogy between propositional attitudes and sensory modes. Propositional attitudes can...
متن کاملEvery Complete Binary Tree is Prime
A graph with a vertex set V is said to have a prime labeling if its vertices can be labeled with distinct integers 1; 2; ; jV j such that for every edge fx; yg, the labels assigned to x and y are relatively prime. A tree is prime if it has at least one prime labeling. Around 1980, Entringer conjectured that every tree is prime. After three decades, this conjecture remains open. Nevertheless, a ...
متن کاملThe uncountable cofinality of the automorphism group of the countable universal distributive lattice
We show that the automorphism group of the countable universal distributive lattice has strong uncountable cofinality, and we adapt the method to deduce the strong uncountable cofinality of the automorphism group of the countable universal generalized boolean algebra.
متن کاملTotal graph of a $0$-distributive lattice
Let £ be a $0$-distributive lattice with the least element $0$, the greatest element $1$, and ${rm Z}(£)$ its set of zero-divisors. In this paper, we introduce the total graph of £, denoted by ${rm T}(G (£))$. It is the graph with all elements of £ as vertices, and for distinct $x, y in £$, the vertices $x$ and $y$ are adjacent if and only if $x vee y in {rm Z}(£)$. The basic properties of the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Structures in Computer Science
سال: 2023
ISSN: ['1469-8072', '0960-1295']
DOI: https://doi.org/10.1017/s0960129523000269